Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach
نویسندگان
چکیده
منابع مشابه
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach
In this paper we address the problem of visualizing a set of individuals, which have attached a statistical value given as a proportion, and a dissimilarity measure. Each individual is represented as a region within the unit square, in such a way that the area of the regions represent the proportions and the distances between them represent the dissimilarities. To enhance the interpretability o...
متن کاملParallel Large Neighborhood Search
Industrial optimization applications must be robust: they must provide good solutions to problem instances of different size and numerical characteristics, and must continue to work well when side constraints are added. A good testbed for constructing such a robust solver is a set of network design problem instances recently made public by France Telecom. Together, these instances comprise the ...
متن کاملLarge neighborhood search
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the l...
متن کاملMulti-Objective Large Neighborhood Search
The large neighborhood search (LNS) framework introduced by Shaw [11] provides a powerful hybridization of Local Search (LS) and Constraint Programming (CP). The idea of LNS is to combine the expressiveness of CP and the efciency of Local Search (LS) without requiring any meta-heuristic. LNS consists in improving a best-so-far solution by iteratively relaxing it and optimizing this solution usi...
متن کاملVery Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.09.018